0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n016.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 06:03:54 EDT 2024 0.12/0.34 % CPUTime : 0.20/0.49 Running higher-order theorem proving 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.Gg8xRKvkHV/E---3.1_28690.p 0.20/0.51 # Version: 3.2.0-ho 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.51 # Starting sh4l with 180s (1) cores 0.20/0.51 # Starting ehoh_best_nonlift_rwall with 180s (1) cores 0.20/0.51 # ehoh_best_nonlift_rwall with pid 28771 completed with status 0 0.20/0.51 # Result found by ehoh_best_nonlift_rwall 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.51 # Starting sh4l with 180s (1) cores 0.20/0.51 # Starting ehoh_best_nonlift_rwall with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGUNF-FFSF00-SFFFFFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # new_ho_10 with pid 28776 completed with status 0 0.20/0.51 # Result found by new_ho_10 0.20/0.51 # Preprocessing class: HSSSSMSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.51 # Starting new_ho_10 with 900s (5) cores 0.20/0.51 # Starting ho_unfolding_6 with 180s (1) cores 0.20/0.51 # Starting sh4l with 180s (1) cores 0.20/0.51 # Starting ehoh_best_nonlift_rwall with 180s (1) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: HGUNF-FFSF00-SFFFFFNN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.51 # Starting new_ho_10 with 98s (1) cores 0.20/0.51 # Preprocessing time : 0.001 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_sort1, type, rat: $tType). 0.20/0.51 thf(decl_22, type, x0: rat). 0.20/0.51 thf(decl_23, type, y0: rat). 0.20/0.51 thf(decl_24, type, less: rat > rat > $o). 0.20/0.51 thf(decl_25, type, is: rat > rat > $o). 0.20/0.51 thf(decl_26, type, more: rat > rat > $o). 0.20/0.51 thf(n, axiom, ~((~((less @ x0 @ y0))=>(is @ x0 @ y0))), file('/export/starexec/sandbox2/tmp/tmp.Gg8xRKvkHV/E---3.1_28690.p', n)). 0.20/0.51 thf(satz81a, axiom, ![X1:rat, X2:rat]:((~((is @ X1 @ X2))=>(~((more @ X1 @ X2))=>(less @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.Gg8xRKvkHV/E---3.1_28690.p', satz81a)). 0.20/0.51 thf(satz81k, conjecture, (more @ x0 @ y0), file('/export/starexec/sandbox2/tmp/tmp.Gg8xRKvkHV/E---3.1_28690.p', satz81k)). 0.20/0.51 thf(c_0_3, plain, ~((~(less @ x0 @ y0)=>(is @ x0 @ y0))), inference(fof_simplification,[status(thm)],[n])). 0.20/0.51 thf(c_0_4, plain, ![X1:rat, X2:rat]:((~(is @ X1 @ X2)=>(~(more @ X1 @ X2)=>(less @ X1 @ X2)))), inference(fof_simplification,[status(thm)],[satz81a])). 0.20/0.51 thf(c_0_5, negated_conjecture, ~(more @ x0 @ y0), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz81k])])). 0.20/0.51 thf(c_0_6, plain, (~(less @ x0 @ y0)&~(is @ x0 @ y0)), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])). 0.20/0.51 thf(c_0_7, plain, ![X7:rat, X8:rat]:(((is @ X7 @ X8)|((more @ X7 @ X8)|(less @ X7 @ X8)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.20/0.51 thf(c_0_8, negated_conjecture, ~(more @ x0 @ y0), inference(fof_nnf,[status(thm)],[c_0_5])). 0.20/0.51 thf(c_0_9, plain, ~((less @ x0 @ y0)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.51 thf(c_0_10, plain, ![X1:rat, X2:rat]:(((is @ X1 @ X2)|(more @ X1 @ X2)|(less @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 thf(c_0_11, plain, ~((is @ x0 @ y0)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.51 thf(c_0_12, negated_conjecture, ~((more @ x0 @ y0)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.51 thf(c_0_13, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), c_0_12]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 10 0.20/0.51 # Removed by relevancy pruning/SinE : 0 0.20/0.51 # Initial clauses : 11 0.20/0.51 # Removed in clause preprocessing : 7 0.20/0.51 # Initial clauses in saturation : 4 0.20/0.51 # Processed clauses : 8 0.20/0.51 # ...of these trivial : 0 0.20/0.51 # ...subsumed : 0 0.20/0.51 # ...remaining for further processing : 8 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 0 0.20/0.51 # Backward-rewritten : 0 0.20/0.51 # Generated clauses : 1 0.20/0.51 # ...of the previous two non-redundant : 0 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 1 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Disequality decompositions : 0 0.20/0.51 # Total rewrite steps : 0 0.20/0.51 # ...of those cached : 0 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 4 0.20/0.51 # Positive orientable unit clauses : 0 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 3 0.20/0.51 # Non-unit-clauses : 1 0.20/0.51 # Current number of unprocessed clauses: 0 0.20/0.51 # ...number of literals in the above : 0 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 4 0.20/0.51 # Clause-clause subsumption calls (NU) : 0 0.20/0.51 # Rec. Clause-clause subsumption calls : 0 0.20/0.51 # Non-unit clause-clause subsumptions : 0 0.20/0.51 # Unit Clause-clause subsumption calls : 0 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 0 0.20/0.51 # BW rewrite match successes : 0 0.20/0.51 # Condensation attempts : 8 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 324 0.20/0.51 # Search garbage collected termcells : 39 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.004 s 0.20/0.51 # System time : 0.001 s 0.20/0.51 # Total time : 0.005 s 0.20/0.51 # Maximum resident set size: 1784 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.005 s 0.20/0.51 # System time : 0.003 s 0.20/0.51 # Total time : 0.008 s 0.20/0.51 # Maximum resident set size: 1712 pages 0.20/0.51 % E---3.1 exiting 0.20/0.51 % E exiting 0.20/0.51 EOF